Studies on Rotary Circular Arc Extraction Column
نویسندگان
چکیده
منابع مشابه
Circular arc detection based on Hough transform
A new method is proposed to detect circular arcs. The detection of a circular arc includes the determination of its center, radius, length, and midpoint. The Hough transform is applied to detect circular arcs by using center and radius as parameters. A peak value in the parameter space of the Hough transform indicates the existence of a circular arc. The center and radius of the circular arc ar...
متن کاملPerfect Circular Arc Coloring
The circular arc coloring problem is to find a minimum coloring of a set of arcs of a circle so that no two overlapping arcs share a color. This N P-hard problem arises in a rich variety of applications and has been studied extensively. In this paper we present an O(n2m) combinatorial algorithm for optimally coloring any set of arcs that corresponds to a perfect graph, and propose a new approac...
متن کاملRobust Circular Arc Detection
In this paper we present a method to robustly detect circular arcs in a line drawing image. The method is fast, robust and very reliable, and is capable of assessing the quality of its detection. It is based on Random Sample Consensus minimization, and uses techniques that are inspired from object tracking in image sequences. It is based on simple initial guesses, either based on connected line...
متن کاملOn some subclasses of circular-arc graphs
The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. In this paper, all possible intersections of these subclasses are studied. There are thirteen regions. Twelve of these are nonempty, an...
متن کاملFinding Maximum Cliques on Circular-Arc Graphs
An algorithm is presented that, given the intersection model S of a circular-arc graph G with n vertices and m edges. finds a maximum-sized clique of GinO (n21oglogn) time. The previously best time bound for this problem is 0 (n 21ogn + mn). • 1ltis work was supported by Ihe Office of Naval Research under Conr:racr.s NOOOl4-84-K-DS02 and NOOOl4-86-K-0689. and by the National Science Foundation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemical engineering
سال: 1966
ISSN: 0375-9253
DOI: 10.1252/kakoronbunshu1953.30.1003